Что (кто) такое B-heap - определение
B-heap
DATA STRUCTURE
A B-heap is a binary heap implemented to keep subtrees in a single page. This reduces the number of pages accessed by up to a factor of ten for big heaps when using virtual memory, compared with the traditional implementation.
Heap (data structure)
TREE-BASED DATA STRUCTURE IN COMPUTER SCIENCE
Min-heap; Heapify; Heap property; Min heap order; Heap (computer science); Heap structure; Minimum-heap property; Max-heap property; Min-heap property; Heap data structure; Maximum-heap property; Max-heap; Heapselect
In computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C.
Heap, Bury
FORMER CIVIL PARISH IN GREATER MANCHESTER, UK
Heap, Greater Manchester
Heap was a district of Bury, England until it was abolished in 1894 to become parts of the parishes of Heywood, Bury, Bircle and Unsworth.
